Minimization of Quantum Multiple-valued Decision Diagrams Using Data Structure Metrics

نویسندگان

  • David Y. Feinstein
  • Mitchell A. Thornton
  • D. Michael Miller
چکیده

This paper describes new metrics for size minimization of the data structure referred to as quantum multiple-valued decision diagrams (QMDD). QMDD are used to represent the matrices describing reversible and quantum gates and circuits. We explore metrics related to the frequency of edges with non-zero weight for the entire QMDD data structure and their histograms with respect to each variable. We observe some unique regularity particular to the methodology of the QMDD. We develop new heuristics for QMDD dynamic variable ordering (DVO) that are guided by the proposed metrics. An exhaustive sifting procedure was implemented for benchmark circuits with up to ten variables to obtain the optimal minimization, demonstrating the effectiveness of the proposed minimization techniques based on data structure metrics.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

QMDD Minimization Using Sifting for Variable Reordering

This paper considers variable reordering for quantum multiplevalued decision diagrams (QMDDs) used to represent the matrices describing reversible/quantum gates and circuits. An efficient method for adjacent variable interchange is presented and this method is employed to implement a vertex reduction procedure for QMDDs using sifting. Experimental results are presented showing the effectiveness...

متن کامل

Property Checking of Quantum Circuits Using Quantum Multiple-Valued Decision Diagrams

For the validation and verification of quantum circuits mainly techniques based on simulation are applied. Although lots of effort has been put into the improvement of these techniques, ensuring the correctness still requires an exhaustive consideration of all input vectors. As a result, these techniques are particularly insufficient to prove a circuit to be error free. As an alternative, we pr...

متن کامل

Lower Bound Sifting for MDDs

Decision Diagrams (DDs) are a data structure for the representation and manipulation of discrete logic functions often applied in VLSI CAD. Common DDs to represent Boolean functions are Binary Decision Diagrams (BDDs). Multiple-valued logic functions can be represented by Multiple-valued Decision Diagrams (MDDs). The efficiency of a DD representation strongly depends on the variable ordering; t...

متن کامل

Quantum Multiple-Valued Decision Diagrams Containing Skipped Variables

Quantum multiple-valued decision diagrams (QMDD) are data structures that enable efficient representation and manipulation of unitary matrices representing reversible and quantum circuits. QMDDs are of the form of a rooted, directed, acyclic graph with initial and terminal vertices where each vertex is annotated with a variable name representing a circuit line. Directed paths from the intial to...

متن کامل

Chun-Myoung Park : SWITCHING FUNCTION USING EDGE-VALUED DECISION DIAGRAM

This paper presents a method of constructing the switching function using edge-valued decision diagrams. The proposed method is as following. The edge-valued decision diagram is a new data structure type of decision diagram which is recently used in constructing the digital logic systems based on the graph theory. Next, we apply edge-valued decision diagram to function minimization of digital l...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Multiple-Valued Logic and Soft Computing

دوره 15  شماره 

صفحات  -

تاریخ انتشار 2009